#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>

using namespace std;
using LL = long long;

int k, n;

void solve(){
    cin >> k >> n;

    int fo = 1, d = 0;
    
    for(int i = 1; i <= k; i ++){
        if(fo + d + k - i <= n){
            fo += d;
            d ++;
            cout << fo << " ";
        }else{
            fo ++;
            cout << fo << " ";
        }
    }
    cout << '\n';
}

int main(){
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--){
        solve();
    }


    return 0;
}